随机变量序列函数的几乎处处中心极限定理

该文证明了随机元序列的一个一般的几乎处处中心极限定理, 并把这一结论应用于随机变量序列的函数.     

Picard Groups of Rings of Coinvariants

Let k be a field, H a Hopf k-algebra with bijective antipode, A a right H-comodule algebra and C a Hopf algebra with bijective antipode which is also a right H-module coalgebra. Under some appropriate assumptions, and assuming that the set of grouplike elements G(A ⊗ C) of the coring A ⊗ C is a group, we show how to calculate, via an exact sequence, the Picard group of the subring of coinvariants in terms of the Picard group of A and various subgroups of G(A ⊗ C). Presented by: Claus Ringel.     

Large-deviation probabilities for maxima of sums of subexponential random variables with application to finite-time ruin probabilities

We establish an asymptotic relation for the large-deviation probabilities of the maxima of sums of subexponential random variables centered by multiples of order statistics of i.i.d.standard uniform random variables.This extends a corresponding result of Korshunov.As an application,we generalize a result of Tang,the uniform asymptotic estimate for the finite-time ruin probability,to the whole strongly subexponential class.     

关于强正则环的刻画

通过单边理想是广义弱理想来刻画强正则环,证明了下列条件是等价的:①R是强正则环;②R是半素的左GP-V′-环,且每一个极大的左理想是广义弱理想;③R是半素的左GP-V′-环,且每一个极大的右理想是广义弱理想.     

Indépendance algébrique sur les T-modules

We study the transcendence degree (of the values at algebraic points) of the coordinate functions of a given one parameter subgroup on a simple g dimensional T-module. In such a situation, we obtain a lower bound for this transcendence degree depending on g and on the growth order of the parameter subgroup. As a particular case, one gets the finite characteristic analogue of a result of Siegel on the algebraic independence for the values of the classical Bessel function. Résumé. Nous obtenons une minoration du degré de transcendance d'un ensemble de valeurs en des points algébriques des fonctions coordonnées d'un sous-groupe à un paramètre d'un T-module simple, en fonction de l'ordre de croissance de ces dernières et de la dimension du T-module. Un cas particulier de ce résultat permet d'obtenir en caractéristique finie un analogue d'un résultat de Siegel sur l'indépendance algébrique des valeurs de la fonction de Bessel usuelle.     

Bitableau bases for Garsia-Haiman modules of hollow type

Garsia-Haiman modules C[Xn,Yn]/Iγ are quotient rings in the variables Xn={x₁,x₂,…,xn} and Yn={y₁,y₂,…,yn} that generalize the quotient ring C[Xn]/I, where I is the ideal generated by the elementary symmetric polynomials ej(Xn) for 1?j?n. A bitableau basis for the Garsia-Haiman modules of hollow type is constructed. Applications of this basis to representation theory and other related polynomial spaces are considered.     

β_∞(Ω)中算子的小紧扰动(英文)

We consider an approximation problem related to strongly irreducible operators, that is, does the direct sum of a strongly irreducible operator in в∞(Ω) and certain operator have a small compact perturbation which is a strongly irreducible operator in в∞(Ω)? In this paper, we prove that the direct sum of any strongly irreducible operator in в∞(Ω) and certain biquasitriangular operator have small compact perturbations which are strongly irreducible operators in в∞(Ω).     

强正则 $(\alpha,\beta)$-族和平移强正则 $(\alpha,\beta)$-几何

本文给出了强正则$(\alpha,\beta)-$族的概念,它是[4]和[5]中$SPG-$族概念的推广.进一步,给出了一种用强正则 $(\alpha,\beta)-$族构造强正则$(\alpha,\beta)-$几何的方法.另外,本文还证明了由强正则$(\alpha,\beta)-$线汇构造的强正则$(\alpha,\beta)-$几何是平移强正则$(\alpha,\beta)-$几何;当$t-r>\beta$时,反之亦成立.     

算子强不可约的充要条件

本文证明了Cowen-Douglas 算子是强不可约的充要条件,是它的换位代数模去其Jacobson 根同构于$H^{\infty}(D)$中的一个闭子代数,这里$D$表示开单位圆盘, $H^{\infty}(D)$表示$D$上的有界解析函数的全体.     

A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity

In this paper, a kind of optimization problems with nonlinear inequality constraints is discussed. Combined the ideas of norm-relaxed SQP method and strongly sub-feasible direction method as well as a pivoting operation, a new fast algorithm with arbitrary initial point for the discussed problem is presented. At each iteration of the algorithm, an improved direction is obtained by solving only one direction finding subproblem which possesses small scale and always has an optimal solution, and to avoid the Maratos effect, another correction direction is yielded by a simple explicit formula. Since the line search technique can automatically combine the initialization and optimization processes, after finite iterations, the iteration points always get into the feasible set. The proposed algorithm is proved to be globally convergent and superlinearly convergent under mild conditions without the strict complementarity. Finally, some numerical tests are reported.